Near-Optimal Sensor Placement for Linear Inverse Problems
نویسندگان
چکیده
منابع مشابه
Optimal Sensor Placement for FDI using Binary Integer Linear Programming
Abstract: This work is devoted to find an optimal set of sensors for model-based FDI. The novelty is that binary integer linear programming is used in the optimization problem, leading to a formulation of the detectability and isolability specifications as linear inequality constraints. Furthermore, a very detailed system model is not needed since the methodology handles structural models. The ...
متن کاملOptimal sensor placement for detection of non-linear structural behavior
Most Structural Health Monitoring (SHM) techniques are based on the variation of modal properties of structures. Modal analysis is established under the assumption that the structure behaviour is linear. However, the presence of non-linearities (local or global, smooth or strong) can affect the dynamic properties of the structure. Most of techniques to detect non-linear behaviour in structural ...
متن کاملSensing the real world: inverse problems, sparsity and sensor placement
A sensor is a device that detects or measures a physical property and records, indicates, or otherwise responds to it. In other words, a sensor allows us to interact with the surrounding environment, by measuring qualitatively or quantitatively a given phenomena. Biological evolution provided every living entity with a set of sensors to ease the survival to daily challenges. In addition to the ...
متن کاملIll-Posed and Linear Inverse Problems
In this paper ill-posed linear inverse problems that arises in many applications is considered. The instability of special kind of these problems and it's relation to the kernel, is described. For finding a stable solution to these problems we need some kind of regularization that is presented. The results have been applied for a singular equation.
متن کاملAggregation for Linear Inverse Problems
In the framework of inverse problems, we consider the question of aggregating estimators taken from a given collection. Extending usual results for the direct case, we propose a new penalty to achieve the best aggregation. An oracle inequality provides the asymptotic behavior of this estimator. We investigate here the price for considering indirect observations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2014
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2014.2299518